Cutting-Plane Proofs in Polynomial Space

نویسنده

  • William J. Cook
چکیده

The integer programming problem is to decide if a given system of linear inequalities has an integral solution. Recent progress on this algorithmic question has involved techniques from the geometry of numbers, in the celebrated paper of Lenstra [20] and in results of Babai [1], Gr6tschel, Lovfisz and Schrijver [14] and Kannan [16]. One of the things that is apparent in these results is the importance of the fact that if a polyhedron contains no integral vectors then there must be some direction in which it is not very 'wide'. This idea has been developed more fully by Kannan and Lovfisz [17], who obtained a theorem which provides much more information on the appearance of such polyhedra. These 'width' results have consequences for the construction and analysis of p roof systems for verifying that a polyhedron contains no integral vectors. Whereas the integer programming problem is directly related to the question of the equality of P and NP, the existence of a polynomiallength proof system for integer programming is equivalent to NP = co-NP. One of the fundamental concepts in the theory of integer programming is that of cutting planes, going back to the work of Dantzig, Fulkerson and Johnson [11] and Gomory [12]. On the practical side, cutting-plane techniques are the basis of very successful algorithms for the solution of large-scale combinatorial and 0-1 programming problems in Crowder, Johnson and Padberg [9], Crowder and Padberg [10], Gr/Stschel, Jiinger and Reinelt [13], Padberg, van Roy and Wolsey [21] and elsewhere. On the theoretical side, Chvfital [3, 4, 5, 6] has shown that the notion of cutting planes leads to many nice results and proofs in combinatorics. We will adopt Chvfital's point of view and consider cutting planes as a proof system, in our case for verifying that polyhedra contain no integral vectors. Perhaps the best known of all proof systems is the resolution method for proving the unsatisfiability of formulas in the proposit ional calculus. Haken [15] settled a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cutting plane and Frege proofs

The cutting plane refutation system CP for propositional logic is an extension of resolution and is based on showing the non-existence of solutions for families of integer linear inequalities. We deene the system CP + , a modiication of the cutting plane system, and show that CP + can polynomially simulate Frege systems F. In 8], it is shown that F polynomially simulates CP + , so both systems ...

متن کامل

Cutting planes, connectivity, and threshold logic

Originating from work in operations research the cutting plane refutation system CP is an extension of resolution, where unsatisfiable propositional logic formulas in conjunctive normal form are recognized by showing the non-existence of boolean solutions to associated families of linear inequalities. Polynomial size CP proofs are given for the undirected s-t connectivity principle. The subsyst...

متن کامل

Upper and Lower Bounds for Tree-Like Cutting Planes Proofs

In this paper we study the complexity of Cutting Planes (CP) refutations, and tree-like CP refutations. Tree-like CP proofs are natural and still quite powerful. In particular, the propositional pigeonhole principle (PHP) has been shown to have polynomial-sized tree-like CP proofs. Our main result shows that a family of tautologies, introduced in this paper requires exponential-sized tree-like ...

متن کامل

Complexity of Semi-algebraic Proofs

It is a known approach to translate propositional formulas into systems of polynomial inequalities and consider proof systems for the latter. The well-studied proof systems of this type are the Cutting Plane proof system (CP) utilizing linear inequalities and the Lovász– Schrijver calculi (LS) utilizing quadratic inequalities. We introduce generalizations LS of LS that operate on polynomial ine...

متن کامل

On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs

We study the mixing inequalities which were introduced by Günlük and Pochet (2001). We show that a mixing inequality which mixes n MIR inequalities has MIR rank at most n if it is a type I mixing inequality and at most n− 1 if it is a type II mixing inequality. We also show that these bounds are tight for n = 2. Given a mixed-integer set PI = P ∩ Z(I) where P is a polyhedron and Z(I) = {x ∈ Rn ...

متن کامل

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua

We present a new method for proving rank lower bounds for Cutting Planes (CP) and several procedures based on lifting due to Lovász and Schrijver (LS), when viewed as proof systems for unsatisfiability. We apply this method to obtain the following new results: First, we prove near-optimal rank bounds for Cutting Planes and LovászSchrijver proofs for several prominent unsatisfiable CNF examples,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 47  شماره 

صفحات  -

تاریخ انتشار 1990